Abstract Interpretation of Recursive Queries
نویسندگان
چکیده
Interpretation of Recursive Queries Agostino Cortesi and Raju Halder 1 DAIS, Università Ca’ Foscari Venezia, Italy [email protected] 2 Dept. of Comp. Sc. & Engg., Indian Institute of Technology Patna, India Abstract. In this paper, we extend recent works on concrete and abstract semantics of structured query languages by considering recursive queries too. We show that combining abstraction of data and widening operators that guarantee the convergence of the computation may be useful not only for static analysis purposes, but also as a sound and effective tool for query language transformations. In this paper, we extend recent works on concrete and abstract semantics of structured query languages by considering recursive queries too. We show that combining abstraction of data and widening operators that guarantee the convergence of the computation may be useful not only for static analysis purposes, but also as a sound and effective tool for query language transformations.
منابع مشابه
On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case
ABSTRACT We classify functions in recursive graph theory in terms of how many queries to K (or ∅ or ∅) are required to compute them. We show that (1) binary search is optimal (in terms of the number of queries to K) for finding the chromatic number of a recursive graph and that no set of Turing degree less than 0 will suffice, (2) determining if a recursive graph has a finite chromatic number i...
متن کاملRule discovery on related objects
Many-to-many relations are often observed between real life objects. When many-tomany relations are between objects in the same class the data mining process becomes more complicated than mining objects when there are no such recursive relations. Mining objects related to other objects in the same class requires construction and execution of recursive queries and hence interpretation of the res...
متن کاملOn the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case
William I. Gasarch Department of Computer Science Institute for Advanced Study University of Maryland College Park, MD 20742 ABSTRACT A recursive graph is a graph whose edge set and vertex set are both recursive. Although the chromatic number of a recursive graph G (denoted χ(G)) cannot be determined recursively, it can be determined if queries to the halting set are allowed. We show that the p...
متن کاملRecursive Abstractions for Parameterized Systems
We consider a language of recursively defined formulas about arrays of variables, suitable for specifying safety properties of parameterized systems. We then present an abstract interpretation framework which translates a paramerized system as a symbolic transition system which propagates such formulas as abstractions of underlying concrete states. The main contribution is a proof method for im...
متن کاملOn Polymorphic Recursion, Type Systems, and Abstract Interpretation
The problem of typing polymorphic recursion (i.e., recursive function definitions rec {x = e} where different occurrences of x in e are used with different types) has been investigated both by people working on type systems and by people working on abstract interpretation. Recently, Gori and Levi have developed a family of abstract interpreters that are able to type all the ML typable recursive...
متن کامل